5,234 research outputs found
Loop-corrected belief propagation for lattice spin models
Belief propagation (BP) is a message-passing method for solving probabilistic
graphical models. It is very successful in treating disordered models (such as
spin glasses) on random graphs. On the other hand, finite-dimensional lattice
models have an abundant number of short loops, and the BP method is still far
from being satisfactory in treating the complicated loop-induced correlations
in these systems. Here we propose a loop-corrected BP method to take into
account the effect of short loops in lattice spin models. We demonstrate,
through an application to the square-lattice Ising model, that loop-corrected
BP improves over the naive BP method significantly. We also implement
loop-corrected BP at the coarse-grained region graph level to further boost its
performance.Comment: 11 pages, minor changes with new references added. Final version as
published in EPJ
A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery
This paper studies a recovery task of finding a low multilinear-rank tensor
that fulfills some linear constraints in the general settings, which has many
applications in computer vision and graphics. This problem is named as the low
multilinear-rank tensor recovery problem. The variable splitting technique and
convex relaxation technique are used to transform this problem into a tractable
constrained optimization problem. Considering the favorable structure of the
problem, we develop a splitting augmented Lagrangian method to solve the
resulting problem. The proposed algorithm is easily implemented and its
convergence can be proved under some conditions. Some preliminary numerical
results on randomly generated and real completion problems show that the
proposed algorithm is very effective and robust for tackling the low
multilinear-rank tensor completion problem
- …